翻訳と辞書 Words near each other ・ King Abdullah Financial District ・ King Abdullah I Mosque ・ King Abdullah II Stadium ・ King Abdullah Petroleum Studies and Research Center ・ King Abdullah Sport City Stadium ・ King Abdullah Sports City ・ King Abdullah University Hospital ・ King Abdullah University of Science and Technology ・ King Adora ・ King Agron ・ King Ahaz's Seal ・ King Ai of Chu ・ Kinetic logic ・ Kinetic Luna ・ Kinetic military action ・ Kinetic minimum box ・ Kinetic minimum spanning tree ・ Kinetic Monte Carlo ・ Kinetic Monte Carlo surface growth method ・ Kinetic Mountain Goat ・ Kinetic novel ・ Kinetic photography ・ Kinetic Playground ・ Kinetic PreProcessor ・ Kinetic priority queue ・ Kinetic proofreading ・ Kinetic Rain ・ Kinetic Records ・ Kinetic resolution ・ Kinetic Rule Language Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Kinetic minimum box ： ウィキペディア英語版 Kinetic minimum box Kinetic minimum box is a kinetic data structure to maintain the minimum bounding box of a set of points whose positions change continuously with time. For points moving in a plane, the kinetic convex hull data structure can be used as a basis for a responsive, compact and efficient kinetic minimum box data structure. == 2D case == The 2D kinetic minimum box builds on the 2D kinetic convex hull in a manner similar to the kinetic width data structure which maintains the pair of minimum-distance parallel lines that have the entire point set between them. In this case, since a box consists of two pairs of parallel lines (that are perpendicular to each other), analogy can be made with running two perpendicular kinetic width problems, and the data-structure needs to maintain sets of four points - two antipodal pairs which have perpendicular supporting lines. In the dual view where a point maps to a line , four envelopes (left, right, upper, lower) are computed. The range in x-values of a line segment in one of these envelopes corresponds to the range in the supporting slopes of the corresponding convex hull vertex in the primal view. Thus, an interval where the x-values of the four envelopes lists overlap (which can be obtained by merging the lists) corresponds, in the primal view, to a slope range where all lines parallel and perpendicular to the slopes support the same four convex hull vertices. The minimum box (in terms of area or perimeter) can be easily computed for each slope range and the four vertices thus supported, and then the global minimum box can be found by minimizing over these intervals. This algorithm can be kinetized by maintaining the convex hull in a kinetic convex hull data structure, the merge of the four envelope lists in a kinetic sorted list and the boxes in a kinetic priority queue. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Kinetic minimum box」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.